clusterMLD: An Efficient Hierarchical Clustering Method for Multivariate Longitudinal Data
نویسندگان
چکیده
Longitudinal data clustering is challenging because the grouping has to account for similarity of individual trajectories in presence sparse and irregular times observation. This paper puts forward a hierarchical agglomerative method based on dissimilarity metric that quantifies cost merging two distinct groups curves, which are depicted by B-splines repeatedly measured data. Extensive simulations show proposed superior performance determining number clusters, classifying individuals into correct computational efficiency. Importantly, not only suitable multivariate longitudinal with measurements but also intensely functional Towards this end, we provide an R package implementation such analyses. To illustrate use method, large clinical sets from real-world studies analyzed.
منابع مشابه
HIERARCHICAL DATA CLUSTERING MODEL FOR ANALYZING PASSENGERS’ TRIP IN HIGHWAYS
One of the most important issues in urban planning is developing sustainable public transportation. The basic condition for this purpose is analyzing current condition especially based on data. Data mining is a set of new techniques that are beyond statistical data analyzing. Clustering techniques is a subset of it that one of it’s techniques used for analyzing passengers’ trip. The result of...
متن کاملClustering for Multivariate Continuous and Discrete Longitudinal Data
Multiple outcomes, both continuous and discrete, are routinely gathered on subjects in longitudinal studies and during routine clinical follow-up in general. To motivate our work, we consider a longitudinal study on patients with primary biliary cirrhosis (PBC) with a continuous bilirubin level, a discrete platelet count and a dichotomous indication of blood vessel malformations as examples of ...
متن کاملAn Efficient Hierarchical Clustering Technique for Speciation
The sharing method or the basic clearing procedure are reliable niching methods. However, they suffer from a quite high complexity: from O(n2) to O(c n), where c is the number of subpopulations and n is the population size. In this paper, an efficient hierarchical clustering technique is presented, reducing the complexity of these niching methods to O(n log n). On the other hand, the minimal ni...
متن کاملAn Efficient Incremental Clustering Method for Incremental Cloud Data
Cloud Computing is a technology that uses the internet and central remote servers to maintain data and applications. Cloud computing allows consumers and businesses to use applications without installation and access their personal files at any computer with internet access. This technology allows for much more efficient computing by centralizing data storage, processing and bandwidth. Typicall...
متن کاملPCS: An Efficient Clustering Method for High-Dimensional Data
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database applications remains a challenge. We devise in this paper a set-theoretic clustering method called PCS (Pairwise Consensus Scheme) for high-dimensional data. Given a large set of d-dimensional data, PCS first constructs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2023
ISSN: ['1061-8600', '1537-2715']
DOI: https://doi.org/10.1080/10618600.2022.2149540